Bounded cost algorithms for multivalued consensus using binary consensus instances

In this paper, we present two bounded cost algorithms that solve multivalued consensus using binary consensus instances. Our first algorithm uses dlog2 ne number of binary consensus instances where n is the number of processes, while our second algorithm uses at most 2k̃ binary consensus instances, where k̃ is the maximum length of the binary representation of all proposed values in the run. Both algorithms are significant improvements over the previous algorithm in [6], where the number of binary consensus instances needed to solve one multivalued consensus is unbounded.